Type Inference with Selftype

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type Inference with Inequalities

Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric polymorphism, and assignments. Type correctness is expressed as satisfiability of a possibly infinite collection of (monotonic) inequalities on the types of variables and expressions. A general result about systems of ...

متن کامل

Type Inference with Simple Selftypes is NP-complete

The metavariable self is fundamental in object-oriented languages. Typing self in the presence of inheritance has been studied by Abadi and Cardelli, Bruce, and others. A key concept in these developments is the notion of selftype, which enables flexible type annotations that are impossible with recursive types and subtyping. Bruce et al. demonstrated that, for the language TOOPLE, type checkin...

متن کامل

Type Inference with Set Theoretic Type Operators

We study an extension of the Hindley/Milner type system including union, intersection and recursive types as well as subtyping and a limited form of bounded poly-morphism. In this system|as in many other systems with subtyping|the type inference problem reduces to a problem of solving inclusion constraints. We encode types as regular tree expressions/set constraints, and show how well-known tec...

متن کامل

Securing Perl with Type Inference

The Perl programming language has several features that predispose it to use by casual programmers[25]. These features also make it safer to use than lowlevel languages like C, in a security sense. However, Perl uses a very permissive dynamic typing system that prevents the compiler from identifying type errors at compile time. In this paper, we discuss a type system for Perl that should help e...

متن کامل

Type Inference with Partial Types

As a partial solution to the problem of combining static and dynamic typing in a language with parametric polymorphism, this paper introduces a new form of type expressions which represent partial type information. These expressions are meant to capture the type information statically derivable from heterogeneous objects. The new ground types form a semilattice of subtypes and require type infe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BRICS Report Series

سال: 1995

ISSN: 1601-5355,0909-0878

DOI: 10.7146/brics.v2i34.19937